Finding the root graph through minimum edge deletion

The line graph of a G has one node per each edge G, two them being adjacent only when the corresponding edges have in common. In this work, we consider problem finding minimum number to delete so that resulting is graph, which presents an interesting application haplotyping diploid organisms. We propose Integer Linear Programming formulation for problem. compare our approach with other existing and explore possibility combining both them. Finally, present computational study different approaches proposed.